Adaptive Quadrature - Revisited
نویسندگان
چکیده
First, the basic principles of adaptive quadrature are reviewed. Adaptive quadrature programs being recursive by nature, the choice of a good termination criterion is given particular attention. Two Matlab quadrature programs are presented. The first is an implementation of the well-known adaptive recursive Simpson rule; the second is new and is based on a four-point Gauss–Lobatto formula and two successive Kronrod extensions. Comparative test results are described and attention is drawn to serious deficiencies in the adaptive routines quad and quad8 provided by Matlab. AMS subject classification: 65D30, 65D32.
منابع مشابه
Interval Integration Revisited
We present an overview of approaches to selfvalidating one-dimensional integration quadrature formulas and a verified numerical integration algorithm with an adaptive strategy. The new interval integration adaptive algorithm delivers a desired integral enclosure with an error bounded by a specified error bound. The adaptive technique is usually much more efficient than Simpson’s rule and narrow...
متن کاملReducing Ranking Effects in Parallel Adaptive Quadrature
We develop parallel one-dimensional globally adaptive quadrature algorithms, building on NAG code D01AKF. Our most eeective strategy replaces D01AKF's error estimate ranking strategy by a tabulation approach. D01AKF uses 61-point Gauss-Kronrod (GK) quadrature. We also use the 21-point GK rule. A fuller discussion, with expanded results, is given in 7].
متن کاملMaximum likelihood estimation of limited and discrete dependent variable models with nested random effects
Gauss–Hermite quadrature is often used to evaluate and maximize the likelihood for random component probit models. Unfortunately, the estimates are biased for large cluster sizes and/or intraclass correlations. We show that adaptive quadrature largely overcomes these problems. We then extend the adaptive quadrature approach to general random coefficient models with limited and discrete dependen...
متن کاملAdaptive Quadrature: Convergence of Parallel and Sequential Algorithms
to adapt their estimates to the particular nature of the integrand f(x). Within the past five years experimental evidence has appeared to suggest that adaptive quadrature algorithms are significantly superior to traditional quadrature formulas because they have a much wider domain of efficient applicability with little sacrifice in computational effort. A metalgorithm is an abstraction represen...
متن کامل